package week_8.实验二_树;

import week_5.LanmoyunExperiment.LinearNode;
import week_6.practice.jsjf.BinaryTreeNode;
import week_6.practice.jsjf.LinkedBinaryTree;

import java.util.Scanner;

public class PushBackTreeTest {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        System.out.println("请输入先序遍历：");
        String a = scan.nextLine();
        System.out.println("请输入中序遍历：");
        String b = scan.next();
        LinkedBinaryTree tree = new LinkedBinaryTree();
        tree.pushBackTree(a,b);
        System.out.println(tree.toString());


    }
}


